منابع مشابه
Survivable minimum bottleneck networks
We show that the survivable bottleneck Steiner tree problem in normed planes can be solved in polynomial time when the number of Steiner points is constant. This is a fundamental problem in wireless ad-hoc network design where the objective is to design networks with efficient routing topologies. Our result holds for a general definition of survivability and for any norm whose ball is specified...
متن کاملApproximating Survivable Networks with Minimum Number of Steiner Points
Given a graph H = (U,E) and connectivity requirements r = {r(u, v) : u, v ∈ R ⊆ U}, we say that H satisfies r if it contains r(u, v) pairwise internally-disjoint uv-paths for all u, v ∈ R. We consider the Survivable Network with Minimum Number of Steiner Points (SN-MSP) problem: given a finite set V of points in a normed space (M, ‖·‖) and connectivity requirements, find a minimum size set S ⊂ ...
متن کاملDesign of Survivable Optical Networks with Minimum CAPEX
We present a genetic algorithm for the design of survivable networks with minimum capital expenditure. The survivability against any single link failure is ensured by path dedicated protection. An integer linear programming model to evaluate the quality of the genetic algorithm solutions is also presented. Using the integer linear programming model and the genetic algorithm near-optimal topolog...
متن کاملApproximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points
We consider low connectivity variants of the Survivable Network with Minimum Number of Steiner Points (SN-MSP) problem: given a finite set R of terminals in a metric space (M,d), a subset B ⊆ R of “unstable” terminals, and connectivity requirements {ruv : u, v ∈ R}, find a minimum size set S ⊆ M of additional points such that the unit-disc graph of R∪S contains ruv pairwise internally edge-disj...
متن کاملMinimum survivable graphs with bounded distance increase
We study in graphs a property related to fault-tolerance in case a node fails. A graph G is k-self-repairing, where k is a non-negative integer, if after the removal of any vertex no distance in the surviving graph increase by more than k. We give upper and lower bounds on the minimum number of edges of a k-self-repairing graph for prescribed k and n, where n is the order of the graph. We also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2015
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2015.06.002